Automated Generation of Electronic Procedures: Procedure Constraint Grammars

نویسنده

  • Ronald M. Lee
چکیده

Electronic trade procedures or ‘scenarios’ are ready made, generic and reusable transaction models for trade communities such as seaports, banking, logistics, etc. They are made available to parties for downloading from repositories provided by international, regional, or industry organizations. However, current workflow-like representations of trade scenarios do not provide for situation-specific customization of the transaction model. Instead of designing specific trade procedures for each possible variation of a transaction, we develop a generative grammar formalism that defines entire families of related trade procedures. Since trade procedures are influenced by various situation-specific factors from multiple sources, we have been led to modify the usual grammar formalism to take into account a variety of constraints. The formalism is, therefore, called a procedure constraint grammar (PCG). The resulting functionality allows for a far greater level of flexibility for customized electronic trade procedures than current approaches provide. Numerous examples are provided. D 2002 Elsevier Science B.V. All rights reserved.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

ar X iv : c s . PL / 0 10 60 59 v 1 2 9 Ju n 20 01 CHR as grammar formalism A first report

Grammars written as Constraint Handling Rules (CHR) can be executed as efficient and robust bottom-up parsers that provide a straightforward, non-backtracking treatment of ambiguity. Abduction with integrity constraints as well as other dynamic hypothesis generation techniques fit naturally into such grammars and are exemplified for anaphora resolution, coordination and text interpretation.

متن کامل

Interfacing Constraint-Based Grammars and Generation Algorithms

Constraint-based grammars can, in principle, serve as the major linguistic knowledge source for both parsing and generation. Surface generation starts from input semantics representations that may vary across grammars. For many declarative grammars, the concept of derivation implicitly built in is that of parsing. They may thus not be interpretable by a generation algorithm. We show that lingui...

متن کامل

A CLP-Based Tool for Computer Aided Generation and Solving of Maths Exercises

We propose an interesting application of Constraint Logic Programming to automatic generation and explanation of mathematics exercises. A particular topic in mathematics is considered to investigate and illustrate the advantages of using the CLP paradigm. The goal is to develop software components that make the formulation and explanation of exercises easier. We describe exercises by grammars w...

متن کامل

Institut F Ur Informatik Lehr-und Forschungseinheit F Ur Programmier-und Modellierungssprachen Oettingenstraae 67, D{80538 M Unchen Positive Unit Hyper-resolution Tableaux for Minimal Model Generation Positive Unit Hyper-resolution Tableaux for Minimal Model Generation

Minimal Herbrand models for clausal theories are useful in several areas of computer science, e.g. automated theorem proving, program veriication, logic programming, databases, and artiicial intelligence. In most cases, the conventional model generation algorithms are inappropriate because they generate nonminimal Herbrand models and can be ineecient. This article describes a novel approach for...

متن کامل

Automated Induction with Constrained Tree Automata

We propose a procedure for automated implicit inductive theorem proving for equational specifications made of rewrite rules with conditions and constraints. The constraints are interpreted over constructor terms (representing data values), and may express syntactic equality, disequality, ordering and also membership in a fixed tree language. Constrained equational axioms between constructor ter...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Decision Support Systems

دوره 33  شماره 

صفحات  -

تاریخ انتشار 1999